Coevolutionary Fuzzy Attribute Order Reduction With Complete Attribute-Value Space Tree

نویسندگان

چکیده

Since big data sets are structurally complex, high-dimensional, and their attributes exhibit some redundant irrelevant information, the selection, evaluation, combination of those large-scale pose huge challenges to traditional methods. Fuzzy rough have emerged as a powerful vehicle deal with uncertain fuzzy in problems that involve very large number variables be analyzed short time. In order further overcome inefficiency algorithms data, this paper we present new coevolutionary attribute reduction algorithm (CFAOR) based on complete attribute-value space tree. A tree model decision table is designed adaptively prune optimize The similarity multimodality can extracted satisfy needs users better convergence speed classification performance. Then, rule generate series chains form an efficient cascade entropy threshold. Finally, performance CFAOR assessed set benchmark contain complex high dimensional datasets noise. experimental results demonstrate achieve higher average computational efficiency accuracy, compared state-of-the-art Furthermore, applied extract different tissues surfaces dynamical changing infant cerebral cortex it achieves satisfying consistency medical experts, which shows its potential significance for disorder prediction cerebrum.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Attribute Space Bias for Attribute Reduction

Attribute reduction is an important inductive learning issue addressed by the Rough Sets society. Most existing works on this issue use the minimal attribute bias, i.e., searching for reducts with the minimal number of attributes. But this bias does not work well for datasets where different attributes have different sizes of domains. In this paper, we propose a more reasonable strategy called ...

متن کامل

Fuzzy attribute logic over complete residuated lattices

We present a logic, called fuzzy attribute logic, for reasoning about formulas describing particular attribute dependencies. The formulas are of a form A ⇒ B where A and B are collections of attributes. Our formulas can be interpreted in two ways. First, in data tables with entries containing degrees to which objects (table rows) have attributes (table columns). Second, in database tables where...

متن کامل

Aiding Fuzzy Rule Induction with Fuzzy Rough Attribute Reduction

Many rule induction algorithms are unable to cope with high dimensional descriptions of input features. To enable such techniques to be effective, a redundancy-removing step is usually carried out beforehand. Rough Set Theory (RST) has been used as such a dataset pre-processor with much success, however it is reliant upon a crisp dataset; important information may be lost as a result of quantiz...

متن کامل

Fuzzy-Rough set Approach to Attribute Reduction

Attribute Reduction has a significant role in different branches of artificial intelligence like machine learning, pattern recognition, data mining from databases etc. This paper deals with reduction of unimportant attribute(s) for classification and decision making, using Fuzzy-Rough set. A survey of Fuzzy-Rough set based methods for attribute reduction is presented here.

متن کامل

Containment for Tree Patterns with Attribute Value Comparisons

Tree patterns (TP) is a simple and widely used fragment of XPath. The problem of containment in TP has been extensively studied previously. It was shown that the containment problem ranges from PTime to PSpace depending on the available constructs. In this paper we study the complexity of the containment problem for tree patterns with attribute value comparisons. We show that the complexity ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on emerging topics in computational intelligence

سال: 2021

ISSN: ['2471-285X']

DOI: https://doi.org/10.1109/tetci.2018.2869919